A converse to the log-log law for Martingales

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Log Log Law for Maximal Uniform Spacings

McGill University Let X1 , X2, • . . be a sequence of independent uniformly distributed random variables on [0, 1] and Kn be the kth largest spacing induced by X 1 , X12 . We show that P(Kn < (log n log3n log 2)/n i .o .) = 1 where log, is the j times iterated logarithm. This settles a question left open in Devroye (1981) . Thus, we have lim inf(nKn log n + log3n) _ -log 2 almost surely, and li...

متن کامل

A Robust Methodology for Prediction of DT Wireline Log

DT log is one of the most frequently used wireline logs to determine compression wave velocity. This log is commonly used to gain insight into the elastic and petrophysical parameters of reservoir rocks. Acquisition of DT log is, however, a very expensive and time consuming task. Thus prediction of this log by any means can be a great help by decreasing the amount of money that needs to be allo...

متن کامل

A determinant inequality and log-majorisation for operators

‎Let $lambda_1,dots,lambda_n$  be positive real numbers such that $sum_{k=1}^n lambda_k=1$. In this paper, we prove that for any positive operators $a_1,a_2,ldots, a_n$ in semifinite von Neumann algebra $M$ with faithful normal trace that $t(1)

متن کامل

The log-log LMS algorithm

This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive lter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient. This eliminates the need for multipliers or shifters in the algorithm's update section. The q...

متن کامل

StUSPACE(log n) <= DSPACE(log²n / log log n)

We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 1974

ISSN: 0004-9735

DOI: 10.1017/s1446788700018085